Bus manufacturing workshop scheduling method with routing buffer
نویسندگان
چکیده
منابع مشابه
The school bus routing and scheduling problem with transfers
In this article, we study the school bus routing and scheduling problem with transfers arising in the field of nonperiodic public transportation systems. It deals with the transportation of pupils from home to their school in the morning taking the possibility that pupils may change buses into account. Allowing transfers has several consequences. On the one hand, it allows more flexibility in t...
متن کاملSchool Bus Routing and Scheduling: a Real Case Study
This paper presents a model to schedule school buses transportation routes. Student’s daily routes defined between student’s homes, schools and extra curricula activities are analysed while accounting for three different objectives: number of vehicles, route total time and average passenger travelling time. A combined multiobjective function is defined. As solution method to this problem, a heu...
متن کاملMULTI-OBJECTIVE ROUTING AND SCHEDULING IN FLEXIBLE MANUFACTURING SYSTEMS UNDER UNCERTAINTY
The efficiency of transportation system management plays an important role in the planning and operation efficiency of flexible manufacturing systems. Automated Guided Vehicles (AGV) are part of diversified and advanced techniques in the field of material transportation which have many applications today and act as an intermediary between operating and storage equipment and are routed and contr...
متن کاملThe school bus routing and scheduling problem with mixed loads and transfers
The school bus routing and scheduling problem deals with the transportation of pupils from home to school in the morning and from school to home in the evening. It is a problem in public transportation and differs from typical vehicle routing problems in several aspects, as for example pointed out in [6]. Variants of this problem are often studied in literature. A comprehensive overview of exis...
متن کاملRouting with locality in partitioned-bus meshes
We show that adding partitioned-buses (as opposed to long buses that span an entire row or column) to ordinary meshes can reduce the routing tame b y approximately one-third f o r permutation routing with locality. A matching time lower bound i s also proved. The result can be generalized to multi-packet routing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Simulation and Process Modelling
سال: 2020
ISSN: 1740-2123,1740-2131
DOI: 10.1504/ijspm.2020.10029336